Several Norm Inequalities for Matrices Partitioned into a Small Number of Blocks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cartesian decomposition of matrices and some norm inequalities

Let ‎X be an ‎‎n-‎‎‎‎‎‎square complex matrix with the ‎Cartesian decomposition ‎‎X = A + i ‎B‎‎‎‎‎, ‎where ‎‎A ‎and ‎‎B ‎are ‎‎‎n ‎‎times n‎ ‎Hermitian ‎matrices. ‎It ‎is ‎known ‎that ‎‎$Vert X Vert_p^2 ‎leq 2(Vert A Vert_p^2 + Vert B Vert_p^2)‎‎‎$, ‎where ‎‎$‎p ‎‎geq 2‎$‎ ‎and ‎‎$‎‎Vert . Vert_p$ ‎is ‎the ‎Schatten ‎‎‎‎p-norm.‎ ‎‎ ‎‎In this paper‎, this inequality and some of its improvements ...

متن کامل

A Norm Compression Inequality for Block Partitioned Positive Semidefinite Matrices

where B and D are square blocks. We prove the following inequalities for the Schatten q-norm ||.||q , which are sharp when the blocks are of size at least 2× 2: ||A||q ≤ (2 q − 2)||C||q + ||B|| q q + ||D|| q q, 1 ≤ q ≤ 2, and ||A||q ≥ (2 q − 2)||C||q + ||B|| q q + ||D|| q q, 2 ≤ q. These bounds can be extended to symmetric partitionings into larger numbers of blocks, at the expense of no longer...

متن کامل

New trace norm inequalities for 2 × 2 blocks of diagonal matrices

Several new trace norm inequalities are established for 2n × 2n block matrices, in the special case where the four n × n blocks are diagonal. Some of the inequalities are non-commutative analogs of Hanner's inequality , others describe the behavior of the trace norm under reordering of diagonal entries of the blocks.

متن کامل

cartesian decomposition of matrices and some norm inequalities

let ‎x be an ‎‎n-‎‎‎‎‎‎square complex matrix with the ‎cartesian decomposition ‎‎x = a + i ‎b‎‎‎‎‎, ‎where ‎‎a ‎and ‎‎b ‎are ‎‎‎n ‎‎times n‎ ‎hermitian ‎matrices. ‎it ‎is ‎known ‎that ‎‎$vert x vert_p^2 ‎leq 2(vert a vert_p^2 + vert b vert_p^2)‎‎‎$, ‎where ‎‎$‎p ‎‎geq 2‎$‎ ‎and ‎‎$‎‎vert . vert_p$ ‎is ‎the ‎schatten ‎‎‎‎p-norm.‎ ‎‎ ‎‎in this paper‎, this inequality and some of its improvements ...

متن کامل

Decomposing Matrices into Blocks

In this paper we investigate whether matrices arising from linear or integer programming problems can be decomposed into so-called bordered block diagonal form. More precisely, given some matrix A, we try to assign as many rows as possible to some number β of blocks of size κ such that no two rows assigned to different blocks intersect in a common column. Bordered block diagonal form is desirab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Engineering and Applied Sciences

سال: 2019

ISSN: 1816-949X

DOI: 10.36478/jeasci.2019.4649.4650